SP, a Package for Schubert Polynomials Realized with the Computer Algebra System. MAPLE
نویسنده
چکیده
We present the SP package which provides some functions on Schubert polynomials. These polynomials contain as a subfamily the Schur functions that are the fundamental symmetric functions. They are indexed by permutations and provide a convenient basis of the polynomial ring.
منابع مشابه
SFA, a Package on Symmetric Functions Considered as Operators over the Ring of Polynomials for the Computer Algebra System Maple
Symmetric functions can be considered as operators acting on the ring of polynomials with coeecients in R. We present the package SFA, an implementation of this action for the computer algebra system Maple. As an example, we show how to recover diierent classical expressions of Lagrange inversion, and of Faber polynomials.
متن کاملPDEBellII: A Maple package for finding bilinear forms, bilinear Bäcklund transformations, Lax pairs and conservation laws of the KdV-type equations
Based on the Bell polynomials scheme, this paper presents a Maple computer algebra program PDEBellII which can automatically construct the bilinear forms, bilinear Bäcklund transformations, Lax pairs and conservation laws of the KdV-type soliton equations. Some examples are given to verify the validity of our program.
متن کاملTowards a Behavioral Analysis of Computer Algebra Programs∗
In this paper, we present our initial results on the behavioral analysis of computer algebra programs. The main goal of our work is to find typing and behavioral errors in such programs by static analysis of the source code. This task is more complex for widely used computer algebra languages (Maple and Mathematica) as these are fundamentally different from classical languages: for example they...
متن کاملOn linearization and connection coefficients for generalized Hermite polynomials
We consider the problem of finding explicit formulae, recurrence relations and sign properties for both connection and linearization coefficients for generalized Hermite polynomials. The most computations are carried out by the computer algebra system Maple using appropriate algorithms.
متن کاملA Maple package for verifying ultradiscrete soliton solutions
We present a computer algebra program for verifying soliton solutions of ultradiscrete equations in which both dependent and independent variables take discrete values. The package is applicable to equations and solutions that include the max function. The program is implemented using Maple software.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 1997